Hypergraphic Oriented Matroid Relational Dependency Flow Models of Chemical Reaction Networks
نویسندگان
چکیده
In this paper we derive and present an application of hypergraphic oriented matroids for the purpose of enumerating the variable interdependencies that define the chemical complexes associated with the kinetics of non-linear dynamical system representations of chemical kinetic reaction flow networks. The derivation of a hypergraphic oriented matroid is obtained by defining a closure operator on families of n-subsets of signed multi-sets from which a “Z-module” is obtained. It has been observed that every instantiation of the closure operator on the signed multiset families define a matroid structure. It is then demonstrated that these structures generate a pair of dual matroids corresponding respectively to hyperspanning trees and hypercycles obtained from the corresponding directed hypergraphs. These structures are next systematically evaluated to obtain solution sets that satisfy systems of non-linear chemical kinetic reaction flow networks in the MAP Kinase cascade cell-signaling pathway.
منابع مشابه
Computing the minimum cut in hypergraphic matroids
Hypergraphic matroids were de ned by Lorea as generalizations of graphic matroids. We show that the minimum cut (co-girth) of a multiple of a hypergraphic matroid can be computed in polynomial time. It is well-known that the size of the minimum cut (co-girth) of a graph can be computed in polynomial time. For connected graphs, this is equivalent to computing the co-girth of the circuit matroid....
متن کاملCollective Classification with Relational Dependency Networks
Collective classification models exploit the dependencies in a network of objects to improve predictions. For example, in a network of web pages, the topic of a page may depend on the topics of hyperlinked pages. A relational model capable of expressing and reasoning with such dependencies should achieve superior performance to relational models that ignore such dependencies. In this paper, we ...
متن کاملThe Hypergraphic Tutte/Nash-Williams Theorem via Integer Decomposition, Total Dual Laminarity, and Power Matroids
We reprove the hypergraphic generalization of the Tutte/Nash-Williams theorem, which gives sufficient conditions for a hypergraph to contain k disjoint connected hypergraphs. First we observe the theorem is equivalent to the natural LP relaxation having the integer decomposition property. Then we give a new proof of this property using LP uncrossing methods. We discover that “total dual laminar...
متن کامل1 Relational Dependency Networks
Recent work on graphical models for relational data has demonstrated significant improvements in classification and inference when models represent the dependencies among instances. Despite its use in conventional statistical models, the assumption of instance independence is contradicted by most relational datasets. For example, in citation data there are dependencies among the topics of a pap...
متن کاملAntisymmetric flows in matroids
We present a seemingly new definition of flows and flow numbers for oriented matroids and prove that the flow number ΦL and the antisymmetric flow number ΦLas of an oriented matroid are bounded with its rank. In particular we show that if O is an oriented matroid of rank r then ΦL(O) ≤ r + 2 and ΦLas(O) ≤ 3b 9 2 rc+1. Furthermore, we introduce the notion of a semiflow and show that each oriente...
متن کامل